雷达虚拟维修训练中交互系统的通用性

基于USB接口技术对"通用雷达装备虚拟维修训练系统(URVMTS)"的人机交互系统进行研究,通过合理的软、硬件设计实现了系统的通用性。不同的实装操作部件经过适当的信号调理均可以通过该系统方便地实现与雷达虚拟样机之间的交互。着重介绍了交互系统的通用性设计与实现方法,包括系统的通用性设计方案,USB硬件电路的通用性设计及相应的软件开发。     

A branch and bound algorithm for the minimum storage‐time sequencing problem

The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

后方油库整体生存概率分析计算

针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

稳健局部线性嵌入方法

针对局部线性嵌入方法对于噪声的敏感性,从分析噪声对数据集局部特性的影响入手,提出了稳健局部线性嵌入方法。通过与局部线性嵌入方法的理论分析和实例对比,表明稳健局部线性嵌入方法不仅对噪声影响不敏感,而且对邻域的选择有较好的适应性,可更好地挖掘数据集的本征特性,具有更强的数据可视化能力。     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

动圈式永磁直线直流电机的精英保留多种群遗传优化算法

为了实现陆基无人机电磁弹射器高机动性及其直线弹射电机的高功率密度,针对动圈式永磁直线直流电机,提出精英保留的多种群遗传算法(Multi-Population Genetic Algorithm with Elite Retention, MPGAER)的电机最大功率密度优化方法。以磁通密度和电流密度为约束条件,利用其搜索能力强、收敛速度快的特点优化电机的结构参数,并与磁路法初始设计结果和传统遗传算法优化结果进行比较。结果表明:与磁路法初始设计相比,MPGAER能使电机质量减少6.25%,功率密度提高10%,电机动态性能得到提高;MPGAER优化设计的电机功率密度高于遗传算法设计结果,所提方法有效地解决了在优化过程中出现易收敛于局部最优点和寻优效果差的问题。     

An optimal recursive method for various inventory replenishment models with increasing demand and shortages

We establish various inventory replenishment policies to solve the problem of determining the timing and number of replenishments. We then analytically compare various models, and identify the best alternative among them based on minimizing total relevant costs. Furthermore, we propose a simple and computationally efficient optimal method in a recursive fashion, and provide two examples for illustration. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 791–806, 1997